Computational geometry: Generalized intersection searching
نویسندگان
چکیده
منابع مشابه
Computational Geometry: Generalized (or Colored) Intersection Searching
Michiel Smid Carleton University, Ottawa 1.1 Geometric intersection searching problems . . . . . . . . 1-1 Generalized intersection searching 1.2 Summary of known results . . . . . . . . . . . . . . . . . . . . . . . . . . . 1-3 Axes-parallel objects • Arbitrarily-oriented objects • Problems on the grid • Single-shot problems • External memory and word-RAM algorithms 1.3 Techniques . . . . . . ...
متن کاملEfficient Non-intersection Queries on Aggregated Geometric Data
Geometric intersection searching problems are a well-studied class of query-retrieval problems with many applications. The goal here is to preprocess a set of geometric objects so that the ones that are intersected by a query object can be reported efficiently. Often, a more general version of the problem arises, where the data comes aggregated in disjoint groups and of interest are the groups,...
متن کاملFurther Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
In a generalized intersection searching problem, a set, S, of colored geometrie objects is to be preprocessed so that given some query object, q, the distinct colors of the objects intersected by q can be reported efficiently or the number of such colors can be counted effi.ciently. In the dynamic setting, colored objects can be inserted into or de1eted from S. These problems generalize the wel...
متن کاملAlgorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems
In a generalized intersection searching problem, a set S of colored geometric objects is to be preprocessed so that, given a query object q, the distinct colors of the objects of S that are intersected by q can be reported or counted efficiently. These problems generalize the well-studied standard intersection searching problems and have many applications. Unfortunately, the solutions known for...
متن کاملSome Results for Elementary Operations
We present a number of results for elementary operations concerning the areas of data structures, computational geometry, graph algorithms and string algorithms. Especially, we focus on elementary operations like the dictionary operations, list manipulation, priority queues, temporal precedence, finger search, nearest common ancestors, negative cycle, 3-sided queries, rectangle enclosure, domin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005